A ug 2 00 6 A Finite Equational Base for CCS with Left Merge and Communication Merge ⋆ ⋆ ⋆
نویسنده
چکیده
Using the left merge and communication merge from ACP, we present an equational base (i.e., a ground-complete and ω-complete set of valid equations) for the fragment of CCS without recursion, restriction and relabelling. Our equational base is finite if the set of actions is finite.
منابع مشابه
Finite Equational Bases for Fragments of CCS with Restriction and Relabelling
We investigate the equational theory of several fragments of CCS modulo (strong) bisimilarity with special attention to restriction and relabelling. The largest fragment we consider includes action prefixing, choice, parallel composition without communication, restriction and relabelling. We present a finite equational base (i.e., a finite groundcomplete and omega-complete axiomatisation) for i...
متن کاملCCS with Hennessy's merge has no finite-equational axiomatization
This paper confirms a conjecture of Bergstra and Klop’s from 1984 by establishing that the process algebra obtained by adding an auxiliary operator proposed by Hennessy in 1981 to the recursion free fragment of Milner’s Calculus of Communicationg Systems is not finitely based modulo bisimulation equivalence. Thus Hennessy’s merge cannot replace the left merge and communication merge operators p...
متن کاملFinite Axiomatization over CCS with Hennessy’s Merge
This note shows that split-2 bisimulation equivalence (also known as timed equivalence) affords a finite equational axiomatization over the process algebra obtained by adding an auxiliary operation proposed by Hennessy in 1981 to the recursion free fragment of Milner’s Calculus of Communicating Systems. Thus the addition of a single binary operation, viz. Hennessy’s merge, is sufficient for the...
متن کاملFinite Equational Axiomatization
This paper confirms a conjecture of Bergstra and Klop’s from 1984 by establishing that the process algebra obtained by adding an auxiliary operator proposed by Hennessy in 1981 to the recursion free fragment of Milner’s Calculus of Communicationg Systems is not finitely based modulo bisimulation equivalence. Thus Hennessy’s merge cannot replace the left merge and communication merge operators p...
متن کاملAxioms for Concurrency
We study properties of equational characterisations of congruences defined over process algebras. The languages on which we concentrate are based on CCS, and our equivalences are generally restricted to observational congruences. We start by defining and investigating the notion of extensionality or w-completeness of an axiomatisation with respect to some semantic equivalence, as an extension o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006